Dynamic smooth compressed quadtrees (Fullversion)
نویسندگان
چکیده
We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First, we show that quadtrees as a space-division data structure can be made smooth and dynamic subject to split and merge operations on the quadtree cells. Second, we show that quadtrees used to store a set of points in R can be made smooth and dynamic subject to insertions and deletions of points. The second version uses the first but must additionally deal with compression and alignment of quadtree components. In both cases our updates take 2O(d log d) time, except for the point location part in the second version which has a lower bound of Θ(logn)—but if a pointer (finger) to the correct quadtree cell is given, the rest of the updates take worst-case constant time. Our result implies that several classic and recent results (ranging from ray tracing to planar point location) in computational geometry which use quadtrees can deal with arbitrary point sets on a real RAM pointer machine. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Chapter 2 Quadtrees - Hierarchical Grids
x What do you know? You know just what you perceive. What can you show? Nothin' of what you believe, And as you grow, each thread of life that you leave Will spin around your deeds and dictate your needs As you sell your soul and you sow your seeds, And you wound yourself and your loved one bleeds, And your habits grow, and your conscience feeds On all that you thought you should be – I never t...
متن کاملRandomized Incremental Construction of Compressed Quadtrees
We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task.
متن کاملFaster Searching in Tries and Quadtrees - An Analysis of Level Compression
We analyze the behavior of the level-compressed trie, LC-trie, a compact version of the standard trie data structure. Based on this analysis, we argue that level compression improves the performance of both tries and quadtrees considerably in many practical situations. In particular, we show that LC-tries can be of great use for string searching in compressed text. Both tries and quadtrees are ...
متن کاملAmortized Analysis of Smooth Box Subdivisions in All Dimensions
1 Quadtrees are a well-known data structure for representing geometric data in the plane, and 2 naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting 3 any given leaf. A quadtree is smooth if any two adjacent leaf boxes differ by at most one in 4 height. In this paper, we analyze quadtrees that maintain smoothness with each split operation. 5 Our main r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.05591 شماره
صفحات -
تاریخ انتشار 2017